基于GA_XGBoost模型的大学生科研能力预测问题研究

科学评价大学生科研创新能力对我国科研水平的提高具有重要意义.采用机器学习模型来预测大学生科研能力可以起到良好的效果,提出一种GAXGBoost模型来实现对大学生的科研能力预测.此模型是以Xgboost算法为基础,然后充分利用遗传算法的全局搜索能力自动搜索Xgboost最优超参数,避免了人为经验调参不准确的缺陷,最后采用精英选择策略以此确保每一轮都是最佳的进化结果.通过分析表明,所采用的GAXGBoost模型在大学生科研能力预测的结果中具有很高的精度,将此模型与Logistic Regression、Random Forest、SVM等模型进行对比,GAXGBoost模型的预测精度最高.     

Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

Quantum algorithm for neighborhood preserving embedding

Neighborhood preserving embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality n. However, the algorithm has two disadvantages: (i) It is not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (ii) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points m and an exponential speedup on the dimensionality n under certain conditions over the classical NPE algorithm, and achieve a significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.     

基于视觉辐条图案识别方法的蓝宝石引晶机制研究

工业生产蓝宝石晶体过程中,引晶步骤有着至关重要的地位。引晶必须在温度梯度较小,温度分布趋于稳定的条件下进行。目前,工业生产蓝宝石主要依靠人工经验操控籽晶杆实现引晶操作,但是人工引晶操作的准确性不高会导致成品品质不佳、资源浪费。为此,本文提出一种基于蓝宝石视觉辐条图案识别方法来检测蓝宝石熔体状态自由液面状态,从而实现一种高效率引晶的机制。此方法利用经典骨架化算法细化辐条图案,Harris算子实现特征信息的提取,提取的特征信息放入运动轨迹模型中判断熔体稳定性,分析液面温度分布稳定性从而实现引晶。结果表明,此算法具有有效性,蓝宝石晶体引晶效率大大提高,生产出的成品良率也有提升,可有效指导蓝宝石的工业生产。     

The behavior of capillary suspensions at diverse length scales: From single capillary bridges to bulk

Liquid-liquid-solid systems are becoming increasingly common in everyday life with many possible applications. Here, we focus on a special case of such liquid-liquid-solid systems, namely, capillary suspensions. These capillary suspensions originate from particles that form a network based on capillary forces and are typically composed of solids in a bulk liquid with an added secondary liquid. The structure of particle networks based on capillary bridges possesses unique properties compared with networks formed via other attractive interactions where these differences are inherently related to the properties of the capillary bridges, such as bridge breaking and coalescence between adjacent bridges. Thus, to tailor the mechanical properties of capillary suspensions to specific requirements, it is important to understand the influences on different length scales ranging from the dynamics of the bridges with varying external stimuli to the often heterogeneous network structure.     

全局优化问题的一个新的无参数填充函数

求全局最优化问题的填充函数算法被提出以来，参数的选取和调整一直是制约算法有效性的因素。如何在实际的计算过程中选取合适的参数，直接影响和决定了运算速度和效率。因此，构造不含参数的填充函数就显得极为重要。提出一个新的无参数的填充函数，对其理论性质进行了分析，并给出相应的填充函数算法，数值计算验证了算法的有效性。     

Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid

This letter studies the problem of minimizing increasing set functions, equivalently, maximizing decreasing set functions, over the base matroid. This setting has received great interest, since it generalizes several applied problems including actuator and sensor placement problems in control, task allocation problems, video summarization, and many others. We study two greedy heuristics, namely, the forward and reverse greedy. We provide two novel performance guarantees for the approximate solutions obtained by them depending on both submodularity ratio and curvature.